A formal framework for quantifying voter-controlled privacyJONKER, Hugo; MAUW, Sjouke; JUN PANG et al.Journal of algorithms (Print). 2009, Vol 64, Num 2-3, pp 89-105, issn 0196-6774, 17 p.Article

A statistical approach to crosslingual natural language tasksPINTO, David; CIVERA, Jorge; BARRON-CEDENO, Alberto et al.Journal of algorithms (Print). 2009, Vol 64, Num 1, pp 51-60, issn 0196-6774, 10 p.Article

Post-proceedings of RCRA 2007GAVANELLI, Marco; MANCINI, Toni.Journal of algorithms (Print). 2008, Vol 63, Num 1-3, issn 0196-6774, 150 p.Serial Issue

The effect of structural branching on the efficiency of clause learning SAT solving : An experimental studyJÄRVISALO, Matti; NIEMELÄ, Ilkka.Journal of algorithms (Print). 2008, Vol 63, Num 1-3, pp 90-113, issn 0196-6774, 24 p.Article

Approximation algorithms for spreading pointsCABELLO, Sergio.Journal of algorithms (Print). 2007, Vol 62, Num 2, pp 49-73, issn 0196-6774, 25 p.Article

LSFA'06Journal of algorithms (Print). 2007, Vol 62, Num 3-4, issn 0196-6774, 76 p.Conference Proceedings

A normal form which preserves tautologies and contradictions in a class of fuzzy logicsCALLEJAS BEDREGAL, Benjamin.Journal of algorithms (Print). 2007, Vol 62, Num 3-4, pp 135-147, issn 0196-6774, 13 p.Conference Paper

Approximations for minimum and min-max vehicle routing problemsARKIN, Esther M; HASSIN, Refael; LEVIN, Asaf et al.Journal of algorithms (Print). 2006, Vol 59, Num 1, pp 1-18, issn 0196-6774, 18 p.Article

The RPR² rounding technique for semidefinite programsFEIGE, Uriel; LANGBERG, Michael.Journal of algorithms (Print). 2006, Vol 60, Num 1, pp 1-23, issn 0196-6774, 23 p.Article

A heuristic for the stacker Crane Problem on trees which is almost surely exactCOJA-OGHLAN, Amin; KRUMKE, Sven O; NIERHOFF, Till et al.Journal of algorithms (Print). 2006, Vol 61, Num 1, pp 1-19, issn 0196-6774, 19 p.Article

Compositional competitiveness for distributed algorithmsASPNES, James; WAARTS, Orli.Journal of algorithms (Print). 2005, Vol 54, Num 2, pp 127-151, issn 0196-6774, 25 p.Article

Tight bounds for the performance of Longest in System on DAGsADLER, Micah; ROSEN, Adi.Journal of algorithms (Print). 2005, Vol 55, Num 2, pp 101-112, issn 0196-6774, 12 p.Article

Lowest common ancestors in trees and directed acyclic graphsBENDER, Michael A; FARACH-COLTON, Martin; PEMMASANI, Giridhar et al.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 75-94, issn 0196-6774, 20 p.Article

Analysis of queueing policies in QoS switchesAN ZHU.Journal of algorithms (Print). 2004, Vol 53, Num 2, pp 137-168, issn 0196-6774, 32 p.Article

Deterministic sorting in O(nloglogn) time and linear spaceYIJIE HAN.Journal of algorithms (Print). 2004, Vol 50, Num 1, pp 96-105, issn 0196-6774, 10 p.Article

Inverse parametric sequence alignmentFANGTING SUN; FERNANDEZ-BACA, David; WEI YU et al.Journal of algorithms (Print). 2004, Vol 53, Num 1, pp 36-54, issn 0196-6774, 19 p.Article

MAX CUT in cubic graphsHALPERIN, Eran; LIVNAT, Dror; ZWICK, Uri et al.Journal of algorithms (Print). 2004, Vol 53, Num 2, pp 169-185, issn 0196-6774, 17 p.Article

Multiway cuts in node weighted graphsGARG, Naveen; VAZIRANI, Vijay V; YANNAKAKIS, Mihalis et al.Journal of algorithms (Print). 2004, Vol 50, Num 1, pp 49-61, issn 0196-6774, 13 p.Article

On external-memory MST, SSSP and multi-way planar graph separationARGE, Lars; STØLTING BRODAL, Gerth; TOMA, Laura et al.Journal of algorithms (Print). 2004, Vol 53, Num 2, pp 186-206, issn 0196-6774, 21 p.Article

Tree exploration with little memoryDIKS, Krzysztof; FRAIGNIAUD, Pierre; KRANAKIS, Evangelos et al.Journal of algorithms (Print). 2004, Vol 51, Num 1, pp 38-63, issn 0196-6774, 26 p.Article

An approximation algorithm for finding long paths in Hamiltonian graphsVISHWANATHAN, Sundar.Journal of algorithms (Print). 2004, Vol 50, Num 2, pp 246-256, issn 0196-6774, 11 p.Conference Paper

The complexity of finding small triangulations of convex 3-polytopesBELOW, Alexander; DE LOERA, Jesus A; RICHTER-GEBERT, Jürgen et al.Journal of algorithms (Print). 2004, Vol 50, Num 2, pp 134-167, issn 0196-6774, 34 p.Conference Paper

Polynomial-time approximation schemes for packing and piercing fat objectsCHAN, Timothy M.Journal of algorithms (Print). 2003, Vol 46, Num 2, pp 178-189, issn 0196-6774, 12 p.Article

Vector assignment problems: a general frameworkEPSTEIN, Leah; TASSA, Tamir.Journal of algorithms (Print). 2003, Vol 48, Num 2, pp 360-384, issn 0196-6774, 25 p.Article

Average-case complexity of single-source shortest-paths algorithms: lower and upper boundsMEYER, Ulrich.Journal of algorithms (Print). 2003, Vol 48, Num 1, pp 91-134, issn 0196-6774, 44 p.Conference Paper